Verifiable Partial Escrow of Integer Factors Veriiable Partial Escrow of Integer Factors
نویسندگان
چکیده
We construct an e cient interactive protocol for realizing veri able partial escrow of the factors of an integer n with time-delayed and threshold key recovery features. The computational cost of the new scheme amounts to 10k log2 P multiplications of numbers of size of P , where P is a protocol parameter which permits n of size up to (log2 P ) 4 to be dealt with and k is a security parameter which controls the error probability for correct key escrow under 1=2. The new scheme realizes a practical method for ne tuning the time complexity for factoring an integer, where the complexity tuning has no respect to the size of the integer.
منابع مشابه
Verifiable Partial Escrow of Integer Factors
We construct an eecient interactive protocol for realizing veriiable partial es-crow of the factors of an integer n with time-delayed and threshold key recovery features. The computational cost of the new scheme amounts to 10k log 2 P multiplications of numbers of size of P , where P is a protocol parameter which permits n of size up to (log 2 P) ? 4 to be dealt with and k is a security paramet...
متن کاملVeri able Partial Escrow of Integer Factors
We construct an e cient interactive protocol for realizing veri able partial escrow of the factors of an integer n with time-delayed and threshold key recovery features. The computational cost of the new scheme amounts to 10k log2 P multiplications of numbers of size of P , where P is a protocol parameter which permits n of size up to (log2 P ) 4 to be dealt with and k is a security parameter w...
متن کاملA Practical and Provably Secure Scheme for Publicly Verifiable Secret Sharing and Its Applications
Abs t rac t . A publicly verifiable secret sharing (PVSS) scheme, named by Stadler in [Sta96], is a special VSS scheme in which anyone, not only the shareholders, can verify that the secret shares are correctly distributed. The property of public verifiability is what the first proposed VSS scheme [CGMA85] incorporated but later protocols [GMW87, Fe187, Ped911 failed to include. PVSS can provid...
متن کاملA Verifiable Partial Key Escrow, Based on McCurley Encryption Scheme
In this paper, firstly we propose two new concepts concerning the notion of key escrow encryption schemes: provable partiality and independency. Roughly speaking we say that a scheme has provable partiality if existing polynomial time algorithm for recovering the secret knowing escrowed information implies a polynomial time algorithm that can solve a well-known intractable problem. In addition,...
متن کاملNecessity and Realization of Universally Verifiable Secret Sharing
We argue the necessity of universally veriiable secret sharing for secrets as individual users' cryptographic keys, and propose protocols to realize such secret sharing for two most common public-key cryptosystems: discrete logarithm based and integer factorization based. The universal veriiabil-ity achieves sharing secret with multi third parties as shareholders using two-party protocols in wh...
متن کامل